congruent modulo A

См. также в других словарях:

• Modulo (jargon) — The word modulo (Latin, with respect to a modulus of ) is the Latin ablative of modulus which itself means a small measure. It was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801. Ever since,… …   Wikipedia

• modulo — To the modulus. In mathematics, two numbers are said to be congruent modulo n when they differ by some multiple of n. For instance, 40 is congruent to each of 24 and 32 modulo 8. In Quine s Word and Object the modulus of a stimulus is its… …   Philosophy dictionary

• modulo — preposition Etymology: New Latin, ablative of modulus Date: 1897 with respect to a modulus of < 19 and 54 are congruent modulo 7 > …   New Collegiate Dictionary

• Congruent — Congruence Cette page d’homonymie répertorie les différents sujets et articles partageant un même nom …   Wikipédia en Français

• congruent — adjective Etymology: Middle English, from Latin congruent , congruens, present participle of congruere Date: 15th century 1. congruous 2. superposable so as to be coincident throughout 3. having the difference …   New Collegiate Dictionary

• modulo — /moj euh loh /, adv. Math. with respect to a modulus: 6 is congruent to 11, modulo 5. [1895 1900; < NL modulo, abl. of L modulus MODULUS] * * * …   Universalium

• modulo — 1. preposition /ˈmɒdjʊləʊ/ a) Given a specified modulus of. 21 and 84 are congruent to each other modulo 9, since both numbers leave the same remainder, 3, when divided by 9. b) Except for differences accounted for by. Thus 21 modulo 9 is 3,… …   Wiktionary

• modulo — mod•u•lo [[t]ˈmɒdʒ əˌloʊ[/t]] adv. Math. with respect to a modulus: 6 is congruent to 11, modulo 5[/ex] • Etymology: 1895–1900; < NL modulō, abl. of L modulus modulus …   From formal English to slang

• Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… …   Wikipedia

• Modular arithmetic — In mathematics, modular arithmetic (sometimes called clock arithmetic) is a system of arithmetic for integers, where numbers wrap around after they reach a certain value the modulus. The Swiss mathematician Leonhard Euler pioneered the modern… …   Wikipedia

• Chinese remainder theorem — The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra. In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers.… …   Wikipedia